On the independence number of random graphs
نویسنده
چکیده
منابع مشابه
INDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملOn the independence number and Hamiltonicity of uniform random intersection graphs
In the uniform random intersection graphs model, denoted by G n,m,λ , to each vertex v we assign exactly λ randomly chosen labels of some label set M of m labels and we connect every pair of vertices that has at least one label in common. In this model, we estimate the independence number α(G n,m,λ), for the wide, interesting range m = n α , α < 1 and λ = O(m 1/4). We also prove the hamiltonici...
متن کاملAsteroidal number for some product graphs
The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cy...
متن کاملOn the Independence Number of Random Cubic Graphs
We show that as n —> oo, the independence number c*(G), for almost all 3-regular graphs G on n vertices, is at least (61og(3/2) — 2 — e)n, for any constant e > 0. We prove this by analyzing a greedy algorithm for finding independent sets.
متن کاملOn The Independence Number Of Random Interval Graphs
A random interval graph of order n is generated by picking 2n numbers X 1 : : : X 2n independently from the uniform distribution on 0; 1] and considering the collection of n intervals with extremities X 2i?1 and X 2i for i 2 f1;:::ng. The graph vertices correspond to intervals. Two vertices are connected if the corresponding intervals intersect. This paper characterizes the uctuations of the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 81 شماره
صفحات -
تاریخ انتشار 1990